Inference Under Information Constraints III: Local Privacy Constraints
نویسندگان
چکیده
We study goodness-of-fit and independence testing of discrete distributions in a setting where samples are distributed across multiple users. The users wish to preserve the privacy their data while enabling central server perform tests. Under notion local differential privacy, we propose simple, sample-optimal, communication-efficient protocols for these two questions noninteractive setting, addition may or not share common random seed. In particular, show that availability shared (public) randomness greatly reduces sample complexity. Underlying our public-coin privacy-preserving mappings which, when applied samples, minimally contract distance between respective probability distributions.
منابع مشابه
Information Extraction Under Privacy Constraints
A privacy-constrained information extraction problem is considered where for a pair of correlated discrete random variables (X,Y ) governed by a given joint distribution, an agent observes Y and wants to convey to a potentially public user as much information about Y as possible without compromising the amount of information revealed about X . To this end, the so-called rate-privacy function is...
متن کاملEstimation Efficiency Under Privacy Constraints
We investigate the problem of estimating a random variable Y ∈ Y under a privacy constraint dictated by another correlated random variable X ∈ X , where estimation efficiency and privacy are assessed in terms of two different loss functions. In the discrete case, we use the Hamming loss function and express the corresponding utility-privacy tradeoff in terms of the privacy-constrained guessing ...
متن کاملPersonal Model Training under Privacy Constraints
Many current Internet services rely on inferences from models trained on user data. Commonly, both the training and inference tasks are carried out using cloud resources fed by personal data collected at scale from users. Holding and using such large collections of personal data in the cloud creates privacy risks to the data subjects, but is currently required for users to benefit from such ser...
متن کاملMining Association Rules under Privacy Constraints
Data mining services require accurate input data for their results to be meaningful, but privacy concerns may impel users to provide spurious information. In this chapter, we study whether users can be encouraged to provide correct information by ensuring that the mining process cannot, with any reasonable degree of certainty, violate their privacy. Our analysis is in the context of extracting ...
متن کاملClassifying Unrooted Gaussian Trees under Privacy Constraints
In this work, our objective is to find out how topological and algebraic properties of unrooted Gaussian tree models determine their security robustness, which is measured by our proposed max-min information (MaMI) metric. Such metric quantifies the amount of common randomness extractable through public discussion between two legitimate nodes under an eavesdropper attack. We show some general t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE journal on selected areas in information theory
سال: 2021
ISSN: ['2641-8770']
DOI: https://doi.org/10.1109/jsait.2021.3053569